Parallel Transitive Closure and Point Location in Planar Structures
نویسندگان
چکیده
Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal O(logn) running time using n= logn processors in the EREW PRAM model, n being the number of vertices.
منابع مشابه
On the PVM Computations of Transitive Closure and Algebraic Path Problems
We investigate experimentally, alternative approaches to the distributed parallel computation of a class of problems related to the generic transitive closure problem and the algebraic path problem. Our main result is the comparison of two parallel algorithms for transitive closure, { a straightforward coarse-grained parallel implementation of the Warshall algorithm named Block-Processing (whic...
متن کاملThe Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملLower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
We give a number of new lower bounds in the cell probe model with logarithmic cell size, which entails the same bounds on the random access computer with logarithmic word size and unit cost operations. We study the signed prefix sum problem: given a string of length n of 0s and signed 1s, compute the sum of its ith prefix during updates. We show a lower bound of Ω(logn/ log logn) time per opera...
متن کاملOn the Properties and the Determination of the Wrench-closure Workspace of Planar Parallel Cable-driven Mechanisms
This paper presents a detailed analysis of the constant-orientation wrench-closure workspace of planar three-degree-of-freedom parallel mechanisms driven by four cables. The constantorientation wrench-closure workspace is defined as the subset of the plane wherein, for a given orientation of the moving platform, any planar wrench applied on the moving platform can be balanced by the cable-drive...
متن کاملImproved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components
This paper presents a new deterministic algorithm for decremental maintenance of the transitive closure in a directed graph. The algorithm processes any sequence of edge deletions in O(mn) time and answers queries in constant time. Until now such time bound has only been achieved by a randomized Las Vegas algorithm. In addition to that, a few decremental algorithms for maintaining strongly conn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 20 شماره
صفحات -
تاریخ انتشار 1991